ON - LINE UNCONSTRAINED HANDWRITINGRECOGNITIONBASED ON PROBABILISTIC TECHNIQUESHomayoon
نویسندگان
چکیده
This paper discusses a probabilistic on-line handwriting recognition scheme, based on Hidden Markov Models (HMM's), and its implementation for recognizing handwritten words captured from a tablet. Statistical methods, such as HMM's have been used successfully for speech recognition. These methods have recently been applied to the problem of handwriting recognition as well. This paper, discusses a general recognition system for large vocabulary, writer-independent, unconstrained handwritten text. A key characteristic of the recognition system described here is its real-time performance on Intel 80486 class PC platforms without the large memory requirements of traditional HMM-based systems. A word-error rate of 18.9% is achieved for a writer-independent 21,000 word vocabulary task in the absence of any language model. This recognizer is modiied to handle digits written in Persian or Arabic, producing error rates less than 7%. The grounds for developing a full-scale Persian recognition system are also set.
منابع مشابه
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملOn the Behavior of Damped Quasi-Newton Methods for Unconstrained Optimization
We consider a family of damped quasi-Newton methods for solving unconstrained optimization problems. This family resembles that of Broyden with line searches, except that the change in gradients is replaced by a certain hybrid vector before updating the current Hessian approximation. This damped technique modifies the Hessian approximations so that they are maintained sufficiently positive defi...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملModeling of a Probabilistic Re-Entrant Line Bounded by Limited Operation Utilization Time
This paper presents an analytical model based on mean value analysis (MVA) technique for a probabilistic re-entrant line. The objective is to develop a solution method to determine the total cycle time of a Reflow Screening (RS) operation in a semiconductor assembly plant. The uniqueness of this operation is that it has to be borrowed from another department in order to perform the production s...
متن کاملAccurate Fault Classification of Transmission Line Using Wavelet Transform and Probabilistic Neural Network
Fault classification in distance protection of transmission lines, with considering the wide variation in the fault operating conditions, has been very challenging task. This paper presents a probabilistic neural network (PNN) and new feature selection technique for fault classification in transmission lines. Initially, wavelet transform is used for feature extraction from half cycle of post-fa...
متن کامل